Counting characters above invariant characters in solvable groups

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups

‎Let $G$ be a finite group‎. ‎We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$‎. ‎In this paper we characterize solvable groups $G$ in which the derived covering number is finite‎.‎ 

متن کامل

On State Counting and Characters

We outline the relationship between the thermodynamic densities and quasi-particle descriptions of spectra of RSOS models with an underlying Bethe equation. We use this to prove completeness of states in some cases and then give an algorithm for the construction of branching functions of their emergent conformal field theories. Starting from the Bethe equations of Dn type, we discuss some aspec...

متن کامل

Characters of Nonlinear Groups

Two of the primary methods of constructing automorphic forms are the Langlands program and Howe's theory of dual pairs. The Langlands program concerns a reductive linear group G deened over a number eld. Associated to G is its dual group L G. The con-jectural principle of functoriality says that a homomorphism L H ! L G should provide a \transfer" of automorphic representations from H to those ...

متن کامل

Counting characters in linear group actions

Let G be a finite group and V be a finite G–module. We present upper bounds for the cardinalities of certain subsets of Irr(GV ), such as the set of those χ ∈ Irr(GV ) such that, for a fixed v ∈ V , the restriction of χ to 〈v〉 is not a multiple of the regular character of 〈v〉. These results might be useful in attacking the non–coprime k(GV )–problem.

متن کامل

Characters of Finite Abelian Groups

Example 1.2. The trivial character of G is the homomorphism 1G defined by 1G(g) = 1 for all g ∈ G. Example 1.3. Let G be cyclic of order 4 with generator γ. Since γ4 = 1, a character χ of G has χ(γ)4 = 1, so χ takes only four possible values at γ, namely 1, −1, i, or −i. Once χ(γ) is known, the value of χ elsewhere is determined by multiplicativity: χ(γj) = χ(γ)j . So we get four characters, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2017

ISSN: 0021-8693

DOI: 10.1016/j.jalgebra.2016.10.014